Concurrent and Located Synchronizations in pi-Calculus
نویسنده
چکیده
We present two novel semantics for π-calculus. The first allows one to observe on which channel a synchronization is performed, while the second allows concurrent actions, provided that they do not compete for resources. We present both a reduction and a labeled semantics, and show that they induce the same behavioral equivalence. As our main result we show that bisimilarity is a congruence for the concurrent semantics. This important property fails for the standard semantics.
منابع مشابه
Smooth Orchestrators
A smooth orchestrator is a process with several alternative branches, every one defining synchronizations among co-located channels. Smooth orchestrators constitute a basic mechanism that may express standard workflow patterns in Web services as well as common synchronization constructs in programming languages. Smooth orchestrators may be created in one location and migrated to a different one...
متن کاملHigh-level Concurrent Languages
ing Communications in Mobile Processes Vasco T. Vasconcelos, University of Lisbon Witnessing the increase of complexity on the objects that names may carry in process algebras — from CCS, through the (monadic and then the polyadic) picalculus, to the calculus of objects (where names carry a label together with a tuple of names) — we propose a framework where communications are taken from an abs...
متن کاملAn Extension to Pi-Calculus for Performance Evaluation
Pi-Calculus is a formal method for describing and analyzing the behavior of large distributed and concurrent systems. Pi-calculus offers a conceptual framework for describing and analyzing the concurrent systems whose configuration may change during the computation. With all the advantages that pi-calculus offers, it does not provide any methods for performance evaluation of the systems describ...
متن کاملOpen Bisimulation for the Concurrent Constraint Pi-Calculus
The concurrent constraint pi-calculus (cc-pi-calculus) has been introduced as a model for concluding Service Level Agreements. The cc-pi calculus combines the synchronous communication paradigm of process calculi with the constraint handling mechanism of concurrent constraint programming. While in the original presentation of the calculus a reduction semantics has been proposed, in this work we...
متن کاملCompiling Join-Patterns
The join-calculus is both a name passing calculus and a core language for concurrent and distributed programming. An essential part of its implementation is the compilation of join-patterns. Join-patterns deene new channels and all the synchronizations they take part to at the same time. Relying on the experience based on our two implementations, we study the translation of join-patterns into d...
متن کامل